Computer Science for IGCSE & O level - Algorithm Design And Problem Solving (Section 10 - No. 7)
Which of the following statements are true about a linear search?
It examines items in a list sequentially.
It stops when the target item is found or the list's end is reached.
It requires the data to be sorted beforehand.
It is faster than binary search.
ახსნა
A linear search checks each item sequentially and stops when either the item is found or the search reaches the end of the list.